TSTP Solution File: PUZ109^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : PUZ109^5 : TPTP v8.1.2. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 08:49:14 EDT 2024
% Result : Theorem 0.16s 0.41s
% Output : Refutation 0.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : PUZ109^5 : TPTP v8.1.2. Bugfixed v5.2.0.
% 0.13/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.16/0.36 % Computer : n027.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri May 3 18:07:08 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a TH0_THM_EQU_NAR problem
% 0.16/0.37 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.vUbbybouT8/Vampire---4.8_385
% 0.16/0.39 % (570)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (2999ds/183Mi)
% 0.16/0.40 % (573)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.16/0.40 % (571)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (2999ds/4Mi)
% 0.16/0.40 % (572)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (2999ds/27Mi)
% 0.16/0.40 % (576)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (2999ds/18Mi)
% 0.16/0.40 % (575)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (2999ds/275Mi)
% 0.16/0.40 % (577)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.16/0.40 % (574)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.16/0.40 % (573)Instruction limit reached!
% 0.16/0.40 % (573)------------------------------
% 0.16/0.40 % (573)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40 % (573)Termination reason: Unknown
% 0.16/0.40 % (574)Instruction limit reached!
% 0.16/0.40 % (574)------------------------------
% 0.16/0.40 % (574)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40 % (574)Termination reason: Unknown
% 0.16/0.40 % (574)Termination phase: Property scanning
% 0.16/0.40
% 0.16/0.40 % (574)Memory used [KB]: 895
% 0.16/0.40 % (574)Time elapsed: 0.004 s
% 0.16/0.40 % (574)Instructions burned: 2 (million)
% 0.16/0.40 % (574)------------------------------
% 0.16/0.40 % (574)------------------------------
% 0.16/0.40 % (573)Termination phase: Property scanning
% 0.16/0.40
% 0.16/0.40 % (573)Memory used [KB]: 895
% 0.16/0.40 % (573)Time elapsed: 0.004 s
% 0.16/0.40 % (573)Instructions burned: 2 (million)
% 0.16/0.40 % (573)------------------------------
% 0.16/0.40 % (573)------------------------------
% 0.16/0.40 % (575)Refutation not found, incomplete strategy
% 0.16/0.40 % (575)------------------------------
% 0.16/0.40 % (575)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40 % (577)Instruction limit reached!
% 0.16/0.40 % (577)------------------------------
% 0.16/0.40 % (577)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40 % (577)Termination reason: Unknown
% 0.16/0.40 % (577)Termination phase: Saturation
% 0.16/0.40
% 0.16/0.40 % (577)Memory used [KB]: 5500
% 0.16/0.40 % (577)Time elapsed: 0.005 s
% 0.16/0.40 % (577)Instructions burned: 3 (million)
% 0.16/0.40 % (577)------------------------------
% 0.16/0.40 % (577)------------------------------
% 0.16/0.40 % (575)Termination reason: Refutation not found, incomplete strategy
% 0.16/0.40
% 0.16/0.40
% 0.16/0.40 % (575)Memory used [KB]: 5500
% 0.16/0.40 % (575)Time elapsed: 0.005 s
% 0.16/0.40 % (575)Instructions burned: 2 (million)
% 0.16/0.40 % (575)------------------------------
% 0.16/0.40 % (575)------------------------------
% 0.16/0.40 % (571)Instruction limit reached!
% 0.16/0.40 % (571)------------------------------
% 0.16/0.40 % (571)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40 % (571)Termination reason: Unknown
% 0.16/0.40 % (571)Termination phase: Saturation
% 0.16/0.40
% 0.16/0.40 % (571)Memory used [KB]: 5500
% 0.16/0.40 % (571)Time elapsed: 0.006 s
% 0.16/0.40 % (571)Instructions burned: 4 (million)
% 0.16/0.40 % (571)------------------------------
% 0.16/0.40 % (571)------------------------------
% 0.16/0.41 % (572)First to succeed.
% 0.16/0.41 % (572)Refutation found. Thanks to Tanya!
% 0.16/0.41 % SZS status Theorem for Vampire---4
% 0.16/0.41 % SZS output start Proof for Vampire---4
% 0.16/0.41 thf(func_def_1, type, s: $i > $i).
% 0.16/0.41 thf(func_def_2, type, cCKB6_BLACK: $i > $i > $o).
% 0.16/0.41 thf(func_def_4, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 0.16/0.41 thf(func_def_17, type, sK3: ($i > $i > $o) > $i).
% 0.16/0.41 thf(func_def_18, type, sK4: ($i > $i > $o) > $i).
% 0.16/0.41 thf(func_def_19, type, sK5: $i > $i > $o).
% 0.16/0.41 thf(func_def_20, type, ph6: !>[X0: $tType]:(X0)).
% 0.16/0.41 thf(f90,plain,(
% 0.16/0.41 $false),
% 0.16/0.41 inference(avatar_sat_refutation,[],[f68,f82,f89])).
% 0.16/0.41 thf(f89,plain,(
% 0.16/0.41 spl2_2 | ~spl2_1),
% 0.16/0.41 inference(avatar_split_clause,[],[f86,f56,f60])).
% 0.16/0.41 thf(f60,plain,(
% 0.16/0.41 spl2_2 <=> ($false = (sK5 @ (sK3 @ sK5) @ (sK4 @ sK5)))),
% 0.16/0.41 introduced(avatar_definition,[new_symbols(naming,[spl2_2])])).
% 0.16/0.41 thf(f56,plain,(
% 0.16/0.41 spl2_1 <=> ($false = (sK5 @ (s @ (s @ (sK3 @ sK5))) @ (sK4 @ sK5)))),
% 0.16/0.41 introduced(avatar_definition,[new_symbols(naming,[spl2_1])])).
% 0.16/0.41 thf(f86,plain,(
% 0.16/0.41 ($false = (sK5 @ (sK3 @ sK5) @ (sK4 @ sK5))) | ~spl2_1),
% 0.16/0.41 inference(trivial_inequality_removal,[],[f84])).
% 0.16/0.41 thf(f84,plain,(
% 0.16/0.41 ($false = $true) | ($false = (sK5 @ (sK3 @ sK5) @ (sK4 @ sK5))) | ~spl2_1),
% 0.16/0.41 inference(superposition,[],[f58,f41])).
% 0.16/0.41 thf(f41,plain,(
% 0.16/0.41 ( ! [X2 : $i,X1 : $i] : (($true = (sK5 @ (s @ (s @ X1)) @ X2)) | ($false = (sK5 @ X1 @ X2))) )),
% 0.16/0.41 inference(binary_proxy_clausification,[],[f40])).
% 0.16/0.41 thf(f40,plain,(
% 0.16/0.41 ( ! [X2 : $i,X1 : $i] : (($true = ((sK5 @ (s @ X1) @ (s @ X2)) & (sK5 @ (s @ (s @ X1)) @ X2))) | ($false = (sK5 @ X1 @ X2))) )),
% 0.16/0.41 inference(binary_proxy_clausification,[],[f39])).
% 0.16/0.41 thf(f39,plain,(
% 0.16/0.41 ( ! [X2 : $i,X1 : $i] : (($true = ((sK5 @ X1 @ X2) => ((sK5 @ (s @ X1) @ (s @ X2)) & (sK5 @ (s @ (s @ X1)) @ X2))))) )),
% 0.16/0.41 inference(beta_eta_normalization,[],[f38])).
% 0.16/0.41 thf(f38,plain,(
% 0.16/0.41 ( ! [X2 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: ((sK5 @ X1 @ Y0) => ((sK5 @ (s @ X1) @ (s @ Y0)) & (sK5 @ (s @ (s @ X1)) @ Y0)))) @ X2))) )),
% 0.16/0.41 inference(pi_clausification,[],[f37])).
% 0.16/0.41 thf(f37,plain,(
% 0.16/0.41 ( ! [X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: ((sK5 @ X1 @ Y0) => ((sK5 @ (s @ X1) @ (s @ Y0)) & (sK5 @ (s @ (s @ X1)) @ Y0))))) = $true)) )),
% 0.16/0.41 inference(beta_eta_normalization,[],[f36])).
% 0.16/0.41 thf(f36,plain,(
% 0.16/0.41 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK5 @ Y0 @ Y1) => ((sK5 @ (s @ Y0) @ (s @ Y1)) & (sK5 @ (s @ (s @ Y0)) @ Y1)))))) @ X1))) )),
% 0.16/0.41 inference(pi_clausification,[],[f35])).
% 0.16/0.41 thf(f35,plain,(
% 0.16/0.41 ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK5 @ Y0 @ Y1) => ((sK5 @ (s @ Y0) @ (s @ Y1)) & (sK5 @ (s @ (s @ Y0)) @ Y1))))))) = $true)),
% 0.16/0.41 inference(binary_proxy_clausification,[],[f33])).
% 0.16/0.41 thf(f33,plain,(
% 0.16/0.41 ($true = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK5 @ Y0 @ Y1) => ((sK5 @ (s @ Y0) @ (s @ Y1)) & (sK5 @ (s @ (s @ Y0)) @ Y1))))))) & (sK5 @ c1 @ c1)))),
% 0.16/0.41 inference(binary_proxy_clausification,[],[f31])).
% 0.16/0.41 thf(f31,plain,(
% 0.16/0.41 ($false = (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK5 @ Y0 @ Y1) => ((sK5 @ (s @ Y0) @ (s @ Y1)) & (sK5 @ (s @ (s @ Y0)) @ Y1))))))) & (sK5 @ c1 @ c1)) => (sK5 @ (s @ sK1) @ (s @ sK0))))),
% 0.16/0.41 inference(beta_eta_normalization,[],[f30])).
% 0.16/0.41 thf(f30,plain,(
% 0.16/0.41 (((^[Y0 : $i > $i > $o]: (((!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y1 @ Y2) => ((Y0 @ (s @ Y1) @ (s @ Y2)) & (Y0 @ (s @ (s @ Y1)) @ Y2))))))) & (Y0 @ c1 @ c1)) => (Y0 @ (s @ sK1) @ (s @ sK0)))) @ sK5) = $false)),
% 0.16/0.41 inference(sigma_clausification,[],[f29])).
% 0.16/0.41 thf(f29,plain,(
% 0.16/0.41 ($true != (!! @ ($i > $i > $o) @ (^[Y0 : $i > $i > $o]: (((!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y1 @ Y2) => ((Y0 @ (s @ Y1) @ (s @ Y2)) & (Y0 @ (s @ (s @ Y1)) @ Y2))))))) & (Y0 @ c1 @ c1)) => (Y0 @ (s @ sK1) @ (s @ sK0))))))),
% 0.16/0.41 inference(beta_eta_normalization,[],[f16])).
% 0.16/0.41 thf(f16,plain,(
% 0.16/0.41 ($true != ((^[Y0 : $i]: ((^[Y1 : $i]: (!! @ ($i > $i > $o) @ (^[Y2 : $i > $i > $o]: (((!! @ $i @ (^[Y3 : $i]: (!! @ $i @ (^[Y4 : $i]: ((Y2 @ Y3 @ Y4) => ((Y2 @ (s @ Y3) @ (s @ Y4)) & (Y2 @ (s @ (s @ Y3)) @ Y4))))))) & (Y2 @ c1 @ c1)) => (Y2 @ Y0 @ Y1))))))) @ (s @ sK1) @ (s @ sK0)))),
% 0.16/0.41 inference(definition_unfolding,[],[f12,f14])).
% 0.16/0.41 thf(f14,plain,(
% 0.16/0.41 (cCKB6_BLACK = (^[Y0 : $i]: ((^[Y1 : $i]: (!! @ ($i > $i > $o) @ (^[Y2 : $i > $i > $o]: (((!! @ $i @ (^[Y3 : $i]: (!! @ $i @ (^[Y4 : $i]: ((Y2 @ Y3 @ Y4) => ((Y2 @ (s @ Y3) @ (s @ Y4)) & (Y2 @ (s @ (s @ Y3)) @ Y4))))))) & (Y2 @ c1 @ c1)) => (Y2 @ Y0 @ Y1))))))))),
% 0.16/0.41 inference(cnf_transformation,[],[f8])).
% 0.16/0.41 thf(f8,plain,(
% 0.16/0.41 (cCKB6_BLACK = (^[Y0 : $i]: ((^[Y1 : $i]: (!! @ ($i > $i > $o) @ (^[Y2 : $i > $i > $o]: (((!! @ $i @ (^[Y3 : $i]: (!! @ $i @ (^[Y4 : $i]: ((Y2 @ Y3 @ Y4) => ((Y2 @ (s @ Y3) @ (s @ Y4)) & (Y2 @ (s @ (s @ Y3)) @ Y4))))))) & (Y2 @ c1 @ c1)) => (Y2 @ Y0 @ Y1))))))))),
% 0.16/0.41 inference(fool_elimination,[],[f7])).
% 0.16/0.41 thf(f7,plain,(
% 0.16/0.41 ((^[X0 : $i, X1 : $i] : (! [X2 : $i > $i > $o] : (((X2 @ c1 @ c1) & ! [X3,X4] : ((X2 @ X4 @ X3) => ((X2 @ (s @ (s @ X4)) @ X3) & (X2 @ (s @ X4) @ (s @ X3))))) => (X2 @ X0 @ X1)))) = cCKB6_BLACK)),
% 0.16/0.41 inference(rectify,[],[f1])).
% 0.16/0.41 thf(f1,axiom,(
% 0.16/0.41 ((^[X0 : $i, X1 : $i] : (! [X2 : $i > $i > $o] : (((X2 @ c1 @ c1) & ! [X4,X3] : ((X2 @ X3 @ X4) => ((X2 @ (s @ (s @ X3)) @ X4) & (X2 @ (s @ X3) @ (s @ X4))))) => (X2 @ X0 @ X1)))) = cCKB6_BLACK)),
% 0.16/0.41 file('/export/starexec/sandbox2/tmp/tmp.vUbbybouT8/Vampire---4.8_385',cCKB6_BLACK_def)).
% 0.16/0.41 thf(f12,plain,(
% 0.16/0.41 ($true != (cCKB6_BLACK @ (s @ sK1) @ (s @ sK0)))),
% 0.16/0.41 inference(cnf_transformation,[],[f11])).
% 0.16/0.41 thf(f11,plain,(
% 0.16/0.41 ((cCKB6_BLACK @ sK1 @ sK0) = $true) & ($true != (cCKB6_BLACK @ (s @ sK1) @ (s @ sK0)))),
% 0.16/0.41 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f9,f10])).
% 0.16/0.41 thf(f10,plain,(
% 0.16/0.41 ? [X0,X1] : (($true = (cCKB6_BLACK @ X1 @ X0)) & ($true != (cCKB6_BLACK @ (s @ X1) @ (s @ X0)))) => (((cCKB6_BLACK @ sK1 @ sK0) = $true) & ($true != (cCKB6_BLACK @ (s @ sK1) @ (s @ sK0))))),
% 0.16/0.41 introduced(choice_axiom,[])).
% 0.16/0.41 thf(f9,plain,(
% 0.16/0.41 ? [X0,X1] : (($true = (cCKB6_BLACK @ X1 @ X0)) & ($true != (cCKB6_BLACK @ (s @ X1) @ (s @ X0))))),
% 0.16/0.41 inference(ennf_transformation,[],[f6])).
% 0.16/0.41 thf(f6,plain,(
% 0.16/0.41 ~! [X0,X1] : (($true = (cCKB6_BLACK @ X1 @ X0)) => ($true = (cCKB6_BLACK @ (s @ X1) @ (s @ X0))))),
% 0.16/0.41 inference(fool_elimination,[],[f5])).
% 0.16/0.41 thf(f5,plain,(
% 0.16/0.41 ~! [X0,X1] : ((cCKB6_BLACK @ X1 @ X0) => (cCKB6_BLACK @ (s @ X1) @ (s @ X0)))),
% 0.16/0.41 inference(rectify,[],[f3])).
% 0.16/0.41 thf(f3,negated_conjecture,(
% 0.16/0.41 ~! [X4,X3] : ((cCKB6_BLACK @ X3 @ X4) => (cCKB6_BLACK @ (s @ X3) @ (s @ X4)))),
% 0.16/0.41 inference(negated_conjecture,[],[f2])).
% 0.16/0.41 thf(f2,conjecture,(
% 0.16/0.41 ! [X4,X3] : ((cCKB6_BLACK @ X3 @ X4) => (cCKB6_BLACK @ (s @ X3) @ (s @ X4)))),
% 0.16/0.41 file('/export/starexec/sandbox2/tmp/tmp.vUbbybouT8/Vampire---4.8_385',cCKB6_L9000)).
% 0.16/0.41 thf(f58,plain,(
% 0.16/0.41 ($false = (sK5 @ (s @ (s @ (sK3 @ sK5))) @ (sK4 @ sK5))) | ~spl2_1),
% 0.16/0.41 inference(avatar_component_clause,[],[f56])).
% 0.16/0.41 thf(f82,plain,(
% 0.16/0.41 ~spl2_2),
% 0.16/0.41 inference(avatar_contradiction_clause,[],[f81])).
% 0.16/0.41 thf(f81,plain,(
% 0.16/0.41 $false | ~spl2_2),
% 0.16/0.41 inference(trivial_inequality_removal,[],[f80])).
% 0.16/0.41 thf(f80,plain,(
% 0.16/0.41 ($false = $true) | ~spl2_2),
% 0.16/0.41 inference(forward_demodulation,[],[f79,f45])).
% 0.16/0.41 thf(f45,plain,(
% 0.16/0.41 ($false = (sK5 @ sK1 @ sK0))),
% 0.16/0.41 inference(trivial_inequality_removal,[],[f43])).
% 0.16/0.41 thf(f43,plain,(
% 0.16/0.41 ($false = $true) | ($false = (sK5 @ sK1 @ sK0))),
% 0.16/0.41 inference(superposition,[],[f42,f32])).
% 0.16/0.41 thf(f32,plain,(
% 0.16/0.41 ($false = (sK5 @ (s @ sK1) @ (s @ sK0)))),
% 0.16/0.41 inference(binary_proxy_clausification,[],[f31])).
% 0.16/0.41 thf(f42,plain,(
% 0.16/0.41 ( ! [X2 : $i,X1 : $i] : (((sK5 @ (s @ X1) @ (s @ X2)) = $true) | ($false = (sK5 @ X1 @ X2))) )),
% 0.16/0.41 inference(binary_proxy_clausification,[],[f40])).
% 0.16/0.41 thf(f79,plain,(
% 0.16/0.41 ($true = (sK5 @ sK1 @ sK0)) | ~spl2_2),
% 0.16/0.41 inference(trivial_inequality_removal,[],[f78])).
% 0.16/0.41 thf(f78,plain,(
% 0.16/0.41 ($false = $true) | ($true = (sK5 @ sK1 @ sK0)) | ~spl2_2),
% 0.16/0.41 inference(forward_demodulation,[],[f71,f34])).
% 0.16/0.41 thf(f34,plain,(
% 0.16/0.41 ($true = (sK5 @ c1 @ c1))),
% 0.16/0.41 inference(binary_proxy_clausification,[],[f33])).
% 0.16/0.41 thf(f71,plain,(
% 0.16/0.41 ($false = (sK5 @ c1 @ c1)) | ($true = (sK5 @ sK1 @ sK0)) | ~spl2_2),
% 0.16/0.41 inference(trivial_inequality_removal,[],[f69])).
% 0.16/0.41 thf(f69,plain,(
% 0.16/0.41 ($false = $true) | ($false = (sK5 @ c1 @ c1)) | ($true = (sK5 @ sK1 @ sK0)) | ~spl2_2),
% 0.16/0.41 inference(superposition,[],[f62,f27])).
% 0.16/0.41 thf(f27,plain,(
% 0.16/0.41 ( ! [X1 : $i > $i > $o] : (((X1 @ (sK3 @ X1) @ (sK4 @ X1)) = $true) | ($false = (X1 @ c1 @ c1)) | ((X1 @ sK1 @ sK0) = $true)) )),
% 0.16/0.41 inference(binary_proxy_clausification,[],[f25])).
% 0.16/0.41 thf(f25,plain,(
% 0.16/0.41 ( ! [X1 : $i > $i > $o] : (($false = (X1 @ c1 @ c1)) | ($false = ((X1 @ (sK3 @ X1) @ (sK4 @ X1)) => ((X1 @ (s @ (sK3 @ X1)) @ (s @ (sK4 @ X1))) & (X1 @ (s @ (s @ (sK3 @ X1))) @ (sK4 @ X1))))) | ((X1 @ sK1 @ sK0) = $true)) )),
% 0.16/0.41 inference(beta_eta_normalization,[],[f24])).
% 0.16/0.41 thf(f24,plain,(
% 0.16/0.41 ( ! [X1 : $i > $i > $o] : (($false = (X1 @ c1 @ c1)) | ((X1 @ sK1 @ sK0) = $true) | ($false = ((^[Y0 : $i]: ((X1 @ (sK3 @ X1) @ Y0) => ((X1 @ (s @ (sK3 @ X1)) @ (s @ Y0)) & (X1 @ (s @ (s @ (sK3 @ X1))) @ Y0)))) @ (sK4 @ X1)))) )),
% 0.16/0.41 inference(sigma_clausification,[],[f23])).
% 0.16/0.41 thf(f23,plain,(
% 0.16/0.41 ( ! [X1 : $i > $i > $o] : (($false = (X1 @ c1 @ c1)) | ((X1 @ sK1 @ sK0) = $true) | ((!! @ $i @ (^[Y0 : $i]: ((X1 @ (sK3 @ X1) @ Y0) => ((X1 @ (s @ (sK3 @ X1)) @ (s @ Y0)) & (X1 @ (s @ (s @ (sK3 @ X1))) @ Y0))))) = $false)) )),
% 0.16/0.41 inference(beta_eta_normalization,[],[f22])).
% 0.16/0.41 thf(f22,plain,(
% 0.16/0.41 ( ! [X1 : $i > $i > $o] : (($false = (X1 @ c1 @ c1)) | ((X1 @ sK1 @ sK0) = $true) | ($false = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((X1 @ Y0 @ Y1) => ((X1 @ (s @ Y0) @ (s @ Y1)) & (X1 @ (s @ (s @ Y0)) @ Y1)))))) @ (sK3 @ X1)))) )),
% 0.16/0.41 inference(sigma_clausification,[],[f21])).
% 0.16/0.41 thf(f21,plain,(
% 0.16/0.41 ( ! [X1 : $i > $i > $o] : (($false = (X1 @ c1 @ c1)) | ((X1 @ sK1 @ sK0) = $true) | ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((X1 @ Y0 @ Y1) => ((X1 @ (s @ Y0) @ (s @ Y1)) & (X1 @ (s @ (s @ Y0)) @ Y1))))))) = $false)) )),
% 0.16/0.41 inference(binary_proxy_clausification,[],[f20])).
% 0.16/0.41 thf(f20,plain,(
% 0.16/0.41 ( ! [X1 : $i > $i > $o] : ((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((X1 @ Y0 @ Y1) => ((X1 @ (s @ Y0) @ (s @ Y1)) & (X1 @ (s @ (s @ Y0)) @ Y1))))))) & (X1 @ c1 @ c1)) = $false) | ((X1 @ sK1 @ sK0) = $true)) )),
% 0.16/0.41 inference(binary_proxy_clausification,[],[f19])).
% 0.16/0.41 thf(f19,plain,(
% 0.16/0.41 ( ! [X1 : $i > $i > $o] : (((((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((X1 @ Y0 @ Y1) => ((X1 @ (s @ Y0) @ (s @ Y1)) & (X1 @ (s @ (s @ Y0)) @ Y1))))))) & (X1 @ c1 @ c1)) => (X1 @ sK1 @ sK0)) = $true)) )),
% 0.16/0.41 inference(beta_eta_normalization,[],[f18])).
% 0.16/0.41 thf(f18,plain,(
% 0.16/0.41 ( ! [X1 : $i > $i > $o] : ((((^[Y0 : $i > $i > $o]: (((!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y1 @ Y2) => ((Y0 @ (s @ Y1) @ (s @ Y2)) & (Y0 @ (s @ (s @ Y1)) @ Y2))))))) & (Y0 @ c1 @ c1)) => (Y0 @ sK1 @ sK0))) @ X1) = $true)) )),
% 0.16/0.41 inference(pi_clausification,[],[f17])).
% 0.16/0.41 thf(f17,plain,(
% 0.16/0.41 ($true = (!! @ ($i > $i > $o) @ (^[Y0 : $i > $i > $o]: (((!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y1 @ Y2) => ((Y0 @ (s @ Y1) @ (s @ Y2)) & (Y0 @ (s @ (s @ Y1)) @ Y2))))))) & (Y0 @ c1 @ c1)) => (Y0 @ sK1 @ sK0)))))),
% 0.16/0.41 inference(beta_eta_normalization,[],[f15])).
% 0.16/0.41 thf(f15,plain,(
% 0.16/0.41 (((^[Y0 : $i]: ((^[Y1 : $i]: (!! @ ($i > $i > $o) @ (^[Y2 : $i > $i > $o]: (((!! @ $i @ (^[Y3 : $i]: (!! @ $i @ (^[Y4 : $i]: ((Y2 @ Y3 @ Y4) => ((Y2 @ (s @ Y3) @ (s @ Y4)) & (Y2 @ (s @ (s @ Y3)) @ Y4))))))) & (Y2 @ c1 @ c1)) => (Y2 @ Y0 @ Y1))))))) @ sK1 @ sK0) = $true)),
% 0.16/0.41 inference(definition_unfolding,[],[f13,f14])).
% 0.16/0.41 thf(f13,plain,(
% 0.16/0.41 ((cCKB6_BLACK @ sK1 @ sK0) = $true)),
% 0.16/0.41 inference(cnf_transformation,[],[f11])).
% 0.16/0.41 thf(f62,plain,(
% 0.16/0.41 ($false = (sK5 @ (sK3 @ sK5) @ (sK4 @ sK5))) | ~spl2_2),
% 0.16/0.41 inference(avatar_component_clause,[],[f60])).
% 0.16/0.41 thf(f68,plain,(
% 0.16/0.41 spl2_1 | spl2_2),
% 0.16/0.41 inference(avatar_split_clause,[],[f67,f60,f56])).
% 0.16/0.41 thf(f67,plain,(
% 0.16/0.41 ($false = (sK5 @ (s @ (s @ (sK3 @ sK5))) @ (sK4 @ sK5))) | ($false = (sK5 @ (sK3 @ sK5) @ (sK4 @ sK5)))),
% 0.16/0.41 inference(trivial_inequality_removal,[],[f66])).
% 0.16/0.41 thf(f66,plain,(
% 0.16/0.41 ($false = $true) | ($false = (sK5 @ (s @ (s @ (sK3 @ sK5))) @ (sK4 @ sK5))) | ($false = (sK5 @ (sK3 @ sK5) @ (sK4 @ sK5)))),
% 0.16/0.41 inference(forward_demodulation,[],[f65,f34])).
% 0.16/0.41 thf(f65,plain,(
% 0.16/0.41 ($false = (sK5 @ (sK3 @ sK5) @ (sK4 @ sK5))) | ($false = (sK5 @ (s @ (s @ (sK3 @ sK5))) @ (sK4 @ sK5))) | ($false = (sK5 @ c1 @ c1))),
% 0.16/0.41 inference(trivial_inequality_removal,[],[f64])).
% 0.16/0.41 thf(f64,plain,(
% 0.16/0.41 ($false = (sK5 @ (s @ (s @ (sK3 @ sK5))) @ (sK4 @ sK5))) | ($false = (sK5 @ c1 @ c1)) | ($false = $true) | ($false = (sK5 @ (sK3 @ sK5) @ (sK4 @ sK5)))),
% 0.16/0.41 inference(forward_demodulation,[],[f49,f45])).
% 0.16/0.41 thf(f49,plain,(
% 0.16/0.41 ($false = (sK5 @ (sK3 @ sK5) @ (sK4 @ sK5))) | ($true = (sK5 @ sK1 @ sK0)) | ($false = (sK5 @ (s @ (s @ (sK3 @ sK5))) @ (sK4 @ sK5))) | ($false = (sK5 @ c1 @ c1))),
% 0.16/0.41 inference(trivial_inequality_removal,[],[f48])).
% 0.16/0.41 thf(f48,plain,(
% 0.16/0.41 ($false = (sK5 @ c1 @ c1)) | ($true = (sK5 @ sK1 @ sK0)) | ($false = (sK5 @ (s @ (s @ (sK3 @ sK5))) @ (sK4 @ sK5))) | ($false = $true) | ($false = (sK5 @ (sK3 @ sK5) @ (sK4 @ sK5)))),
% 0.16/0.41 inference(superposition,[],[f42,f28])).
% 0.16/0.41 thf(f28,plain,(
% 0.16/0.41 ( ! [X1 : $i > $i > $o] : (($false = (X1 @ (s @ (sK3 @ X1)) @ (s @ (sK4 @ X1)))) | ((X1 @ sK1 @ sK0) = $true) | ($false = (X1 @ (s @ (s @ (sK3 @ X1))) @ (sK4 @ X1))) | ($false = (X1 @ c1 @ c1))) )),
% 0.16/0.41 inference(binary_proxy_clausification,[],[f26])).
% 0.16/0.41 thf(f26,plain,(
% 0.16/0.41 ( ! [X1 : $i > $i > $o] : (($false = (X1 @ c1 @ c1)) | (((X1 @ (s @ (sK3 @ X1)) @ (s @ (sK4 @ X1))) & (X1 @ (s @ (s @ (sK3 @ X1))) @ (sK4 @ X1))) = $false) | ((X1 @ sK1 @ sK0) = $true)) )),
% 0.16/0.41 inference(binary_proxy_clausification,[],[f25])).
% 0.16/0.41 % SZS output end Proof for Vampire---4
% 0.16/0.41 % (572)------------------------------
% 0.16/0.41 % (572)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.41 % (572)Termination reason: Refutation
% 0.16/0.41
% 0.16/0.41 % (572)Memory used [KB]: 5628
% 0.16/0.41 % (572)Time elapsed: 0.015 s
% 0.16/0.41 % (572)Instructions burned: 9 (million)
% 0.16/0.41 % (572)------------------------------
% 0.16/0.41 % (572)------------------------------
% 0.16/0.41 % (569)Success in time 0.036 s
% 0.16/0.41 % Vampire---4.8 exiting
%------------------------------------------------------------------------------